Balanced Incomplete Block Design (BIBD) as traceable codes

Self-Dual Codes and the (22,8,4) Balanced Incomplete Block Design

We enumerate a list of 594 inequivalent binary (33, 16) doubly-even self-orthogonal codes that have no all-zero coordinates along with their automorphism groups. It is proven that if a (22, 8, 4) Balanced Incomplete Block Design were to exist then the 22 rows of its incident matrix will be contained in at least one of the 594 codes. Without using computers, we eliminate this possibility for 116...

Low Density Parity Check Codes Based on Finite Geometries and Balanced Incomplete Block Design

Low Density Parity Check (LDPC) Codes are the class of linear block codes which provide near capacity performance on large collection of data transmission channels while simultaneously feasible for implementable decoders. LDPC codes were first proposed by Gallger in 1967 [1] and were rarely used until their rediscovery by Mackay, Luby and others [9][10][11]. Much research is devoted to characte...

Splitting balanced incomplete block designs

Calculating Balanced Incomplete Block Design for Educational Assessments

A popular design in large scale' educational assessments is the balanced incomplete block design. The design assumes that the item pool is split into a set of blocks of items that are assigned to assessment booklets. This paper shows how the technique of 0-1 linear programming can be used to calculate a balanced incomplete block design. Several structural as well as practical constraints on thi...

Beautifully Ordered Balanced Incomplete Block Designs

Beautifully Ordered Balanced Incomplete Block Designs, BOBIBD(v, k, λ, k1, λ1), are defined and the proof is given to show that necessary conditions are sufficient for the existence of BOBIBD with block size k=3 and k1=2 and for k=4 and k1=2 except possibly for eleven exceptions. Existence of BOBIBDs with block size k=4 and k1=3 is demonstrated for all but one infinite family and the non-existe...